Gapping through TAG derivation trees
نویسندگان
چکیده
This work provides a TAG account of gapping in English, based on a novel deletion-like operation that is referred to as de-anchoring. De-anchoring applies onto elementary trees, but it is licensed by the derivation tree in two ways. Firstly, de-anchored trees must be linked to the root of the derivation tree by a chain of adjunctions , and the sub-graph of de-anchored nodes in a derivation tree must satisfy certain internal constraints. Secondly, de-anchoring must be licensed by the presence of a homomorphic antecedent derivation tree.
منابع مشابه
One More Perspective on Semantic Relations in TAG
It has often been noted that the derivation trees of “standard” TAG grammars for natural languages (Group, 1998) resemble semantic dependency trees (Mel’ĉuk, 1988). More interesting, from a formal perspective, are the ways in which the derivation trees and the dependency trees diverge for certain problematic constructions. The desire to fix these cases has led to a variety of proposals for modi...
متن کاملTAG Parsing as Model Enumeration
This paper introduces well-ordered derivation trees and makes use of this concept in a novel axiomatization of the TAG parsing problem as a constraint satisfaction problem. Contrary to prior approaches, our axiomatization focuses on the derivation trees rather than the derived trees. Well-ordered derivation trees are our primary models, whereas the derived trees serve solely to determine word o...
متن کاملA Proof System for Tree Adjoining Grammars
Many TAG-based systems employ a particular tree adjoining grammar to generate the intended structures of the set of sentences they aim to describe. However, in most cases, the underlying set of elementary trees is more or less hand-made or maybe derived from a given tree data-base. We present a formal framework that allow to specify tree adjoining grammars by logical formulae. Based on this for...
متن کاملA Declarative Characterization of Different Types of Multicomponent Tree Adjoining Grammars
Multicomponent Tree Adjoining Grammars (MCTAG) is a formalism that has been shown to be useful for many natural language applications. The definition of MCTAG however is problematic since it refers to the process of the derivation itself: a simultaneity constraint must be respected concerning the way the members of the elementary tree sets are added. This way of characterizing MCTAG does not al...
متن کاملUsing an Enriched TAG Derivation Structure as Basis for Semantics
Most of the proposals for semantics in the Tree Adjoining Grammar (TAG) framework suppose that the derivation tree serves as basis for semantics. However, in some cases the derivation tree does not provide the semantic links one needs. This paper concentrates on one of these cases, namely the analysis of quantifiers as adjuncts. The paper proposes to enrich the TAG derivation tree and use the r...
متن کامل